Implementing a Better Cache Replacement Algorithm in Apache Derby Progress Report

The desire to have large amounts of memory with small access latency is desired by all. Caches provide this effect in a manageable fashion. In databases, the buffer pool acts as a cache to reduce the latency to access disk. However, the benefit of caching depends on the effectiveness of the replacement algorithm. In this report, I summarize my work over the past few months on Derby on different cache replacement algorithms and my two implementations. Through simple experiments, I show that both implementations provide better hit rates when compared to the existing Clock algorithm.